The Taming of the Cut. Classical Refutations with Analytic Cut

نویسندگان

  • Marcello D'Agostino
  • Marco Mondadori
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

Preparation of Zoning Maps for Cut-off Wall Using the Geotechnical Parameters and Analytic Hierarchal Process (AHP).

Sarroud Dam is located in the north of Khorasan Razavi Province in the city of Kalat. Being located in a fault zone, it is necessary to inject the cut-off wall. Using remote sensing techniques, geographic information system, Landsat satellite imagery and field observations in this research, it was specified that the dam has been located within the range of the Sarroud Fault. According to this, ...

متن کامل

Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cut-free” sequent calculus has recently been shown to fail cut-elimination. We present a new cut-free sequent calculus for bi-intuitionistic logic, and prove it sound and complete with respect to its Kr...

متن کامل

Completeness and Decidability Results for CTL in Coq

We prove completeness and decidability results for the temporal logic CTL in Coq/Ssreflect. Our basic result is a constructive proof that for every formula one can obtain either a finite model satisfying the formula or a proof in a Hilbert system certifying the unsatisfiability of the formula. The proof is based on a history-augmented tableau system obtained as the dual of Brünnler and Lange’s ...

متن کامل

Analytic Cut for Propositional Dynamic Logic

We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system. The main contribution consists in proving that the system presented is equivalent to a subsystem where only Analytic Cut of a special and restricted kind is permitted. This resolves the long-standing open problem of Cut-elimination for Propositional Dynamic Logic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1994